package shuati;

import java.util.Deque;
import java.util.LinkedList;
import java.util.Scanner;

class Test2{
    public static final String a="RJ";
    static {
        System.out.print("OK");
    }
}

public class Demo06 {

    public static void main(String[] args) {
        System.out.println(Test2.a);
    }



   /* public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int m = in.nextInt();
        int n = in.nextInt();
        int q = in.nextInt();

        //人物关系
        int[][] gra = new int[n][n];
        boolean[][] isK = new boolean[n][n];


        for(int i =0;i<m;i++){
            int u = in.nextInt();
            int v = in.nextInt();
            gra[u][v] = 1;
            gra[v][u] = 1;
        }

        for(int i = 0;i<q;i++){
            int op = in.nextInt();
            int u = in.nextInt();
            int v = in.nextInt();
            if (op == 1){
                gra[u][v] = gra[v][u] = 0;
            }else if(op == 2){
                if (query(u,v,isK,n,gra)){
                    System.out.println("Yes");
                }else{
                    System.out.println("No");
                }
            }
        }
    }

    private static boolean query(int u, int v, boolean[][] isK, int n, int[][] gra) {
        LinkedList<Integer> queue = new LinkedList<>();
        queue.offer(u);
        isK[u][v] = true;
        while (!queue.isEmpty()){
            int x = queue.poll();
            for(int y = 0;y<n ;y++){
                if (gra[x][y] == 1 && !isK[x][y]){
                    queue.offer(y);
                    isK[x][y] = true;
                }
                if (gra[y][x] == 1 && !isK[y][u]){
                    queue.offer(y);
                    isK[y][u] = true;
                }
            }
        }


        return isK[v][u];
    }
*/





 /*   public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int n = in.nextInt();
        int k = in.nextInt();

        int[] arr = new int[n];
        int[][] array = new int[n][2];
        int aa = 0;
        int bb = 0;
        for(int i =0 ;i<n;i++){
            arr[i] = in.nextInt();
            int tmp = arr[i];
            while (tmp%2==0){
                array[i][0]++;
                tmp/=2;
            }
            while (tmp%5==0){
                array[i][1]++;
                tmp/=5;
            }
            aa += array[i][0];
            bb += array[i][1];

        }
        int count = 0;
        for(int i = 0;i<n;i++){
            for(int j = i; j<n;j++){
                int sum2 = 0;
                int sum5 = 0;
                for(int l = i;l<=j;l++){
                    sum2+=array[l][0];
                    sum5+=array[l][1];
                }
                if (aa-sum2>=k && bb-sum5>=k){
                    count++;
                }
            }
        }
        System.out.println(count);



    }*/





    /*public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        String[] arr = new String[n];
        for(int i = 0;i<n;i++){
            arr[i] = in.next();
        }

        System.out.println(0);//第一行为0

        boolean[][] tmp = new boolean[n][n];
        for(int k = 2;k<=n;k++){
            int count = 0;
            for(int i = 0;i+k<=n;i++){
                for(int j = 0;j+k<=n;j++){
                    if (tmp[i][j] == true){
                        tmp[i][j] = false;
                        continue;
                    }
                    if (fun(i,j,k,arr)){
                        count++;
                        tmp[i][j] = true;
                    }
                }
            }
            System.out.println(count);
        }


    }

    private static boolean fun(int i1, int j1, int k, String[] arr) {
        int a = 0;
        int b = 0;
        for(int i = i1;i < i1+k ; i++){
            for(int j = j1;j < j1+k ; j++){
                if (arr[i].charAt(j)=='0'){
                    a++;
                }else{
                    b++;
                }
            }
        }
        if (a==b){
            return true;
        }else{
            return false;
        }

    }



*/












/*    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        String s = in.next();

        int sum = 0;
        for(int i = 0;i<s.length();i++){
            if (s.charAt(i) == 'M' || s.charAt(i) == 'T'){
                sum++;
            }
        }
        if (sum+k<=s.length()){
            sum += k;
        }else{
            sum = s.length();
        }
        System.out.println(sum);

    }*/


    /*public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int q = in.nextInt();
        int[] arr = new int[n];
        long sum = 0L;
        int count = 0;
        for (int i = 0; i < n; i++) {
            int a = in.nextInt();
            if (a == 0){
                count++;
            }
            sum += a;
        }

        for (int i = 0; i < q; i++) {
            int l = in.nextInt();
            int r = in.nextInt();


            long min = sum + count*l;
            long max = sum + count*r;
            System.out.println(min +" "+max);

        }

    }
*/


}
